Propositional Q-Logic

نویسنده

  • Stefan Wölfl
چکیده

Topic of the paper is Q-logic—a logic of agency in its temporal and modal context. Q-logic may be considered as a basal logic of agency since the most important stit-operators discussed in the literature can be defined or axiomatized easily within its semantical and syntactical framework. Its basic agent dependent operator, the Q-operator (also known as ∆or cstit-operator), which has been discussed independently by F. v. Kutschera and B. F. Chellas, is investigated here in respect of its relation to other temporal and modal operators. The main result of the paper, then, is a completeness result for a calculus of Q-logic with respect to a semantics defined on the tree-approach of agency as introduced and developed by, among others, F. v. Kutschera and N. D. Belnap.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Truth Values and Connectives in Some Non-Classical Logics

The question as to whether the propositional logic of Heyting, which was a formalization of Brouwer's intuitionistic logic, is finitely many valued or not, was open for a while (the question was asked by Hahn). Kurt Gödel (1932) introduced an infinite decreasing chain of intermediate logics, which are known nowadays as Gödel logics, for showing that the intuitionistic logic is not finitely (man...

متن کامل

Expressiveness of Temporal Logics

Propositional Logic, Modal Logic and Temporal Logic Definition The syntax of propositional logics is defined as φ ::= p | ¬φ | φ ∨ φ | φ ∧ φ where p ranges over a (finite) set of atomic propositions AP. The semantics is given by truth tables, e.g., for p ∧ q: ∧ > ⊥ > > ⊥ ⊥ ⊥ ⊥ Propositional Logic, Modal Logic and Temporal Logic Definition The syntax of propositional logics is defined as φ ::= p...

متن کامل

Lecture Notes on Completeness and Canonical Models 15-816: Modal Logic

In this lecture we consider a logic as the set of its tautologies. The following definition captures the closure properties that the we expect from this set of tautologies: Definition 1 (Normal modal logic) A set L of formulas is called a normal modal logic if: 1. L contains all propositional tautologies 2. (p→ q)→ ( p→ q) ∈ L for all propositional letters p, q 3. A ∈ L, (A→ B) ∈ L implies B ∈ ...

متن کامل

Embedding classical in minimal implicational logic

Consider the problem which set V of propositional variables suffices for StabV `i A whenever `c A, where StabV := {¬¬P → P | P ∈ V }, and `c and `i denote derivability in classical and intuitionistic implicational logic, respectively. We give a direct proof that stability for the final propositional variable of the (implicational) formula A is sufficient; as a corollary one obtains Glivenko’s t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • J. Philosophical Logic

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2002